Joint thresholding and quantizer selection for transform image coding: entropy-constrained analysis and applications to baseline JPEG

نویسندگان

  • Matthew S. Crouse
  • Kannan Ramchandran
چکیده

Striving to maximize baseline (Joint Photographers Expert Group-JPEG) image quality without compromising compatibility of current JPEG decoders, we develop an image-adaptive JPEG encoding algorithm that jointly optimizes quantizer selection, coefficient "thresholding", and Huffman coding within a rate-distortion (R-D) framework. Practically speaking, our algorithm unifies two previous approaches to image-adaptive JPEG encoding: R-D optimized quantizer selection and R-D optimal thresholding. Conceptually speaking, our algorithm is a logical consequence of entropy-constrained vector quantization (ECVQ) design principles in the severely constrained instance of JPEG-compatible encoding. We explore both viewpoints: the practical, to concretely derive our algorithm, and the conceptual, to justify the claim that our algorithm approaches the best performance that a JPEG encoder can achieve. This performance includes significant objective peak signal-to-noise ratio (PSNR) improvement over previous work and at high rates gives results comparable to state-of-the-art image coders. For example, coding the Lena image at 1.0 b/pixel, our JPEG encoder achieves a PSNR performance of 39.6 dB that slightly exceeds the quoted PSNR results of Shapiro's wavelet-based zero-tree coder. Using a visually based distortion metric, we can achieve noticeable subjective improvement as well. Furthermore, our algorithm may be applied to other systems that use run-length encoding, including intraframe MPEG and subband or wavelet coding.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ISAR Image Improvement Using STFT Kernel Width Optimization Based On Minimum Entropy Criterion

Nowadays, Radar systems have many applications and radar imaging is one of the most important of these applications. Inverse Synthetic Aperture Radar (ISAR) is used to form an image from moving targets. Conventional methods use Fourier transform to retrieve Doppler information. However, because of maneuvering of the target, the Doppler spectrum becomes time-varying and the image is blurred. Joi...

متن کامل

Implementation of ROI Based Baseline Sequential Adaptive Quantization

The JPEG[1] (Joint Photographic Experts Group) introduced a still image graphics format in 1987, known as JPEG. The process flow in the baseline mode, converts color images to 8x8 block based DCT mostly applied for gray images, then we applied quantization for the DCT in zigzag ordering, and obtained entropy coding using Huffman tables in the encoding process is obtained and vice versa for deco...

متن کامل

Weighted universal transform coding: universal image compression with the Karhunen-Loeve transform

We introduce a two-stage universal transform code for image compression. The code combines Karhunen-Lo eve transform coding with weighted universal bit allocation (WUBA) 1] in a two-stage algorithm analogous to the algorithm for weighted universal vector quantization (WUVQ) 2, 3]. The encoder uses a collection of transform / bit allocation pairs rather than a single transform / bit allocation p...

متن کامل

Optimum Global Thresholding Based Variable Block Size DCT Coding For Efficient Image Compression

Image compression is dissimilar than compressing other unprocessed binary data. Obviously, general purpose compression techniques deliberated for raw binary data can be used to compress images, but the result is not the finest one, because of the variations in statistical property of image. Statistical properties of image must be completely exploit by encoders to obtained efficient image compre...

متن کامل

Low-complexity and low-memory entropy coder for image compression

In this paper, a low-complexity and low-memory entropy coder (LLEC) is proposed for image compression. The two key elements in the LLEC are zerotree coding and Golomb–Rice (G–R) codes. Zerotree coding exploits the zerotree structure of transformed coefficients for higher compression efficiency. G–R codes are used to code the remaining coefficients in a variable-length codes/variable-length inte...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on image processing : a publication of the IEEE Signal Processing Society

دوره 6 2  شماره 

صفحات  -

تاریخ انتشار 1997